Method of executing an algorithm for protecting an electronic device by affine masking and associated device

ABSTRACT

A method of executing an algorithm includes protecting an electronic device by affine masking. The electronic device executes operations on secret variables x, the secret variables x being binary vectors of a given size N other than zero. The method further includes replacing the secret variables x using an affine masking operation, by the following affine function: m(x)=R.x+r, where R is a random invertible binary matrix with N rows and N columns and r is a random binary vector of size N.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority to foreign French patent application No. FR 09 04642, filed on Sep. 29, 2009, the disclosure of which is incorporated by reference in its entirety.

FIELD OF THE INVENTION

The present invention relates to a method of executing an algorithm for protecting secret data in an electronic device such as a smart card or a cryptographic component. The secret data to be protected are, for example, variables used in operations executed by a data encryption algorithm. The invention also relates to a device for implementing this method of protecting secret data.

BACKGROUND OF THE INVENTION

The operations executed by a cryptographic device cause variations of physical quantities. These variations differ according to the data processed, which can be measured by an attacker, for example by measuring the power consumption of the device or its electromagnetic radiation. An attacker can use these measurements to obtain information about the secret data handled in the device. To provide a defense against such an attacker, the designer of the device must adapt the executed operations in such a way that the measurable variations caused by them are independent of the secret data.

One method of attacking a device in order to discover the secret data contained in it, known to those skilled in the art, is the “side channel attack”. In this form of attack, the power consumption of the device is measured and this measurement is used to deduce the information contained in it. A defense against such attacks can be provided by a known protection method in which all the sensitive variables x of the algorithm are combined with a random data r. Thus each intermediate variable handled by the device can be written as a function of x and r, m_(r)(x). One of the limitations of this solution is that it is necessary to ensure that x can be retrieved from m_(r)(x) at any step of the algorithm in question. To achieve this, all the operations executed on the variable x must be adapted to allow for the masking method m_(r).

In the case of block encryption algorithms, the sensitive data x handled by this type of algorithm are masked by means of the function m_(r)(x)=x+r, where r is a random variable and the sign ‘+’ refers to the Exclusive OR (XOR) operation.

This method, known in the prior art, is easily implemented, because all the linear or affine operations executed by the algorithm to be protected can be adapted immediately. Furthermore, this method is effective against first-order side channel attacks, in other words those using a single measurement point, such as the power consumption of the device.

One of the main problems of the prior art solution using masking with a function of the type m_(r)(x)=x+r is that it has low resistance to higher-order side channel attacks, in other words those using a plurality of measurement points instead of a single point. This is because the information associated with two points in the measurements corresponding to the processing of the variables x₁+r and x₂+r is strongly correlated with x₁+x₂, resulting in low resistance to the more advanced forms of attack called k-th order attacks, where k is an integer greater than 1.

However, this problem can be resolved by extending the initial solution to a number k of random variables such that masking with a function m_(r)(x)=x+r₁+r₂+ . . . +r_(k) is used, where the variables r₁, r₂, . . . , r_(k) are handled separately. However, this solution does not resolve the problem of an attacker using an indefinite number of measurement points, and moreover it leads to additional implementation costs which are unacceptable in practice when k is large. Furthermore, there is no known solution for implementing such a solution when k is greater than or equal to three.

None of the prior art solutions is capable of resisting known attacks of any order k greater than 1 at an additional complexity cost which is acceptable.

SUMMARY OF THE INVENTION

In order to remedy the drawbacks of the prior art, the present invention proposes a solution in which every intermediate variable x handled by operations executed in the device whose content is to be protected is masked by using affine applications of the m(x)=Rx+r type, where R is a binary invertible matrix. The operations executed by the device are adapted using the mathematical properties of the affine application. This solution enables known attacks of orders greater than one to be resisted, at a lower cost, since the known methods of inferring secret data by using the information associated with at least two measurement points corresponding to the processing of intermediate data will fail when these data are masked by an affine application, by contrast with the prior art solution.

The invention relates to any device capable of implementing cryptographic algorithms or algorithms comprising secret data, for protecting these data against access by persons acting with malicious intent. More specifically, but not exclusively, the invention can be applied to a computer, a mobile terminal, or a smart card. The invention is also applicable to any type of cryptographic algorithm, notably a public key or private key algorithm.

For this purpose, the invention proposes a method of execution including a step of protecting an electronic device by affine masking, where said device executes operations on secret variables x, said variables x being binary vectors of a given size N other than zero, said method being characterized in that said variables x are replaced, using what is known as an affine masking operation, by the following affine function: m(x)=R.x+r, where R is a random invertible binary matrix with N rows and N columns and r is a random binary vector of size N.

In a variant embodiment of the invention, said operation of affine masking of a secret variable x is executed by means of the following steps:

-   -   generate, for each binary vector z of size N, the table T such         that T[z]=Rz+r,     -   replace said secret variable x with T[x].

In a variant embodiment of the invention, said electronic device executes at least one linear operation on a set of secret variables z₁, . . . , z_(m), producing the result z=A₁z₁+A₂z₂+ . . . +A_(m)z_(m), where the variables A₁, A₂ . . . A_(m) are matrices each of which commutes with the matrix R and its inverse R⁻¹, and the operation of affine masking of said result z is carried out by means of the following steps:

-   -   apply said operation of affine masking to the set of said         variables z₁, . . . z_(m) in order to produce the set of masked         variables z₁ , . . . , z_(m) ,     -   determine, from said random vector r and a second random binary         vector r′, a third random vector r″=r′+(A₁+ . . . +A_(m))r,     -   determine the result z of the affine masking operation applied         to the result z of said linear operation, by means of the         following calculation steps:

z =A₁ z ₁ +r″

For i varying from 2 to m,

z = z +A₁ z _(i)

z= z+r+r′

In a variant embodiment of the invention, said electronic device executes at least one linear operation on a set of secret variables z₁, . . . , z_(m) of size N, producing the result z=A₁z₁+A₂z₂+ . . . +A_(m)z_(m), where the variables A₁, A₂ . . . A_(m) are matrices which do not commute with the matrix R and its inverse R⁻¹, and the operation of affine masking of said result z is carried out by means of the following steps:

-   -   determine, for the set of said binary vectors x of size N, the         table T_(R), such that T_(R)[x]=Rx,     -   determine, for the set of said binary vectors x of size N, the         table T_(R) ⁻¹, such that T_(R) ⁻¹[x]=R⁻¹x,     -   determine, for the set of said binary vectors x of size N, the         tables Ā_(i) such that Ā_(i)[x]=T_(R)[A_(i)T_(R) ⁻¹ [x]], for i         varying from 1 to m,     -   apply said operation of affine masking to the set of said         variables z₁, . . . z_(m) in order to produce the set of masked         variables z₁ , . . . , z_(m) ,     -   calculate, from said random vector r and a second random binary         vector r′, the binary vector r″=( A₁ [r]+ . . . + A_(m) [r])+r′,     -   determine the result z of the affine masking operation applied         to the result z of said linear operation, by means of the         following calculation steps:

z = A ₁ [ z ₁ ]+r″

For i varying from 2 to m,

z = z + A _(i) [ z _(i) ]

z= z+r+r′

In a variant embodiment of the invention, said electronic device executes at least one non-linear operation S on at least one secret variable y, producing the result y′=S(y), and the operation of affine masking said result y′ is executed by means of the following steps:

-   -   apply said affine masking operation to the secret variable y in         order to produce the result y=R·y+r,     -   determine an adapted operation S′ of the non-linear operation S         by means of the following relation: S″()=R·S(R⁻¹·(+r))+r,     -   determine the result y′ of the affine masking operation applied         to the result y′ of said non-linear operation, by means of the         following relation: y′=S′( y)

In a variant embodiment of the invention, said electronic device executes a cryptographic algorithm.

The invention also includes an electronic device for executing operations on the secret variables x, comprising means to protect said variables x by applying the steps of the affine masking protection method described above.

In a variant embodiment of the invention, said device is a microcircuit card.

BRIEF DESCRIPTION OF THE DRAWINGS

Other characteristics will be made clear by the following detailed description, given by way of non-limiting example with reference to the appended drawings, in which:

FIG. 1 a is a diagram showing in a schematic way the affine masking method according to the invention applied to a linear transformation, in the case where the matrices A₁, . . . , A_(m), which are coefficients of the linear transformation, commute with the matrices R and R⁻¹;

FIG. 1 b is a diagram showing in a schematic way the affine masking method according to the invention applied to a linear transformation, in the case where the matrices A₁, . . . , A_(m), which are coefficients of the linear transformation, do not commute with the matrices R and R⁻¹;

FIG. 2 is a synoptic diagram of a first example of a device according to the invention;

FIG. 3 is a synoptic diagram of a second example of a device according to the invention; and

FIG. 4 is a diagram of a microcircuit card which implements the method according to the invention.

DETAILED DESCRIPTION

In order to overcome the limitations of the prior art described above, the present invention proposes a method for masking sensitive data by means of affine functions. Notably, the method according to the invention relates to the execution of a data masking algorithm for the purpose of protecting sensitive data. The masking function used in this case to protect a variable x is:

m(x)=R.x⊕r,  (1)

where x is a sensitive variable, such as one handled by an encryption algorithm implemented by a cryptographic device, this variable being represented by a binary vector with N components, where N>0; R is an invertible random binary matrix, in other words one containing no values other than 0 and 1, with a size of N×N; r is a random vector, which is also binary, of size N; ⊕, is the “exclusive or” operation.

The method according to the invention consists, notably, in replacing a variable x with m(x) in order to make it less vulnerable to an attack. This operation is called a masking operation, and in the context of the invention it is an affine masking operation.

This method can be implemented, notably but not exclusively, in two different ways.

In a first embodiment, the affine masking function m(x) is executed by means of a correlation table T[x] which contains the set of values of m(x)=R.x ⊕r for all possible values of the variable x. For a vector x comprising N bits, therefore, there are 2^(N) possible values. Thus the generation of the correlation table T[x] comprises the following steps:

-   -   random drawing of the binary vector r of size N,     -   random drawing of an invertible binary matrix R of size N×N,     -   calculation of m(x)=R.x⊕r for all possible values of x.

For a given sensitive variable x handled by the device to be protected, the affine masking according to the invention is then executed by extracting the corresponding value m(x) in the table T[x].

In a second embodiment, the affine masking function m(x) can be generated directly when the sensitive variable x is to be protected. For this purpose, the invertible binary matrix R and the binary vector r are generated at random for each variable x at the instant when this variable is used in the encryption algorithm.

The variable x handled by the implemented algorithm can be subjected to linear or non-linear operations.

The method according to the invention also consists in adapting these operations in order to mask their result without requiring excessively complex calculations.

FIG. 1 a shows in a schematic way the steps implemented in the masking of a linear combination of masked variables in the case where the matrices A₁, . . . , A_(m) commute with the matrices R and R⁻¹.

Consider the general case of the linear operation defined by the following relation:

z=A ₁ z ₁ +A ₂ z ₂ + . . . +A _(m) z _(m)  (2)

where z₁, . . . , z_(m) are sensitive variables of size N and z₁ , . . . , z_(m) represent their versions masked by means of the affine masking method according to the invention, written with the aid of the relation z_(i) =R.z_(i)+r.

The matrices A₁, . . . , A_(m) are invertible binary matrices with N rows and N columns.

In the special case in which the variables A₁, . . . , A_(m), z₁, . . . , z_(m) can be considered as elements of the finite Galois field GF(2^(N)) with a cardinal number 2^(N), the variable R is found by randomly drawing an invertible matrix element of GF(2^(N)). The variable r is found by randomly drawing a vector element of GF(2^(N)). The table T is generated by tabulating the values of the application x→m(x)=Rx+r for all the vectors x belonging to GF(2^(N)). In this case, the matrices A₁, . . . , A_(m) commute with the matrices R and R⁻¹. It should be remembered that the matrix A_(i) commutes with the matrix R if A_(i)R=RA_(i).

The variable z can then be masked by executing the following calculation steps.

In a first step 111, a random variable r′ is generated by random drawing of a vector from the finite field GF(2^(N)) and the variable r″ is calculated from r′ and from the random variable r used to mask the sensitive variables z₁, . . . z_(m) according to the following relation:

r″=r′+(A ₁ + . . . +A _(m))r  (3)

In a second step 112, the result of the masking z is initialized:

z =A₁ z ₁ +r″  (4)

In a third iteration step 113, the masked variable z is updated by carrying out the following calculation for i varying from 2 to m:

z = z +A_(i) z _(i)   (5)

In a final step 114, the variable z resulting from the affine masking of the linear combination of m other variables is delivered:

z= z+r+r′  (6)

FIG. 1 b shows in a schematic way the steps implemented in the masking of a linear combination of masked variables in the case where the matrices A₁, . . . , A_(m) do not commute with the matrices R and R⁻¹.

If the matrices A₁, . . . , A_(m) do not commute with the matrices R and R⁻¹, the tables T_(R) and T_(R-1) of the applications x→Rx and x→R⁻¹x respectively must be generated at the same time as the table T. The tables T_(R) and T_(R-1) are generated at a marginal cost in execution time in parallel with the generation of the table T.

In this case, the variable z can be masked by executing the following calculation steps.

In an initial step 120 which is executed once only at the start of the procedure, the tables A₁ , . . . , A_(m) are calculated from T_(R) and T_(R-1) according to the relation stating that

A _(i) [x]=T _(R) [A _(i) T _(R) ⁻¹ [x]]  (7)

-   -   for every 1≦i≦m.

In a first step 121, a random variable r′ is generated from the finite field GF(2^(N)) and the variable r″ is calculated from r′, from the tables A_(i) , . . . , A_(m) , and from the random factor r used to mask the sensitive variables z₁, . . . z_(m) according to the following relation:

r″=( A ₁ [r]+ . . . + A_(m) [r])+r′  (8)

In a second step 122, the result of the masking z is initialized according to the following relation:

z = A₁ [ z ₁ ]+r″  (9)

In a third iteration step 123, the masked variable z is updated by carrying out the following calculation for i varying from 2 to m:

z = z+ A_(i) [ z _(i) ]  (10)

In a final step 124, the variable z which is the result 104 of the affine masking of the linear combination of m other variables is delivered:

z= z+r+r′  (11)

Thus the method according to the invention optimizes the execution of the affine masking of linear operations.

The affine masking of the result of non-linear transformations, which can also be implemented by an encryption algorithm, is processed by the masking method according to the invention in the following way.

Let S be a non-linear operation which relates the variable y to the variable y′ according to the following relation:

y′=S(y)  (12)

where y is a sensitive variable and y is its version masked by the affine masking method according to the invention, written with the aid of the relation y=R·y+r.

It is then necessary to calculate the masked version y′ of y′.

In a first step, an adapted version S′ of the linear operation S is calculated, as defined by the following relation:

S′()=R·S(R ⁻¹·(+r))+r  (13)

In a second step, the result of the operation y′ is delivered by applying the operation S′ to the masked variable y:

y′=S′( y )  (14)

The generation of the invertible random matrix R used by the affine masking method according to the invention must be efficient in terms of the complexity of the calculations used in order to avoid giving rise to considerable additional costs of implementation. Moreover, the matrix R must meet a security criterion, in that the number of randomly generated matrices R must be large enough to prevent any attack aimed at discovering the masking system.

FIG. 2 is a schematic view of an example of a device 201 according to the invention protected by one or more affine masking operations according to the invention. This device executes an encryption algorithm, for example. A message 210 is received at the input of the device 201. This message is subjected to a first affine masking operation 211 to make it impossible to interpret. When masked according to the invention, the message 210 undergoes a series of linear operations 212 and non-linear operations 213 which form part of the processes natively implemented in said device 201 but which are adapted according to the invention in order to deliver at their output a compatible masked message of the method according to the invention. In parallel, a key 216, such as an encryption key, is received by the device 201 and also undergoes an affine masking operation 217 according to the invention. The internal variables handled by the device 201 are thus protected from any side channel attack. The message 210 which is masked and then handled by the linear and non-linear operations executed on the device 201 is then unmasked 214 by an operation which is the inverse of that in which a sensitive variable is replaced by its masked version, and the encoded message 215 is then delivered at the output.

FIG. 3 shows in a schematic way a data processing device 340 in which the present invention is applied. This device 340 comprises a microprocessor 310 which is associated with a random access memory 360, by means of a bus 370 for example, and also with a non-volatile memory 320 (such as an EEPROM), by means of a bus 50 for example.

The data processing device 340, and more specifically the microprocessor 310 incorporated in it, can exchange data with external devices by means of a communication interface 330.

FIG. 3 shows schematically the transmission of an input data element X received from an external device (not shown) and transmitted from the communication interface 330 to the microprocessor 310. The transmission of an output data element S of the microprocessor 310 towards the communication interface 330 to be sent on to an external device is represented in a similar way. This output data element Y originates from the processing of data by the microprocessor 310, generally carried out on the input data element X using a secret key 380 internal to the system, such as a private key.

Although, for the purposes of illustration, the input data and the output data are shown on two different arrows, the physical means of communication between the microprocessor 310 and the interface 330 can be made in the form of a single means, such as a serial communications port or a bus.

The microprocessor 310 can run software (or a computer program) which enables the data processing device 340 to execute a method according to the invention, examples of which are provided facing FIGS. 1 a and 1 b. The software is composed of a set of instructions for controlling the microprocessor 310, which are, for example, stored in the memory 320.

In a variant, the assembly formed by the microprocessor 310, non-volatile memory 320 and random access memory 360 can be replaced with a special-purpose circuit which comprises means for implementing the different steps of the data processing method.

FIG. 4 shows a microcircuit card which provides an example of a data processing device according to the invention as shown in FIG. 3. In this case, the communication interface 330 is created by means of the contacts of the microcircuit card. The microcircuit card incorporates a microprocessor 310, a random access memory 360 and a non-volatile memory 320 as shown in FIG. 3.

This microcircuit card conforms to the ISO 7816 standard, for example, and is provided with a secure microcontroller which incorporates the microprocessor (or CPU) 320 and the random access memory 360.

In a variant, the data processing device can be a flash drive, a document or a paper medium which incorporates in one of its pages a microcircuit associated with contactless communication means. Preferably, it is a portable or pocket electronic apparatus.

The method according to the invention has the notable advantage of being simple to implement while being compatible with linear and non-linear operations executed on the sensitive variables protected according to the invention.

The invention also has the advantage of yielding significantly better results than those of the known prior art solutions against known side channel attacks of orders above 2.

In fact, the prior art solution using masking based on XOR operations cannot resist second-order side channel attacks. This is due to the fact that, for any sensitive variable x, an attacker can find two intermediate variables v₁ and v₂ such that x=v₁⊕v₂, and the power consumption C(x) associated with the variable x can be predicted from |C(v₁)−C(v₂)|. However, this prediction is not possible if the variables v₁ and v₂ are masked by an affine masking method according to the invention. In fact, the correlation of C(x) with |C(v₁)−C(v₂)| decreases rapidly with the size n of the vector x, as shown in Table 1.2. The same conclusion can be reached if we attempt to predict C(x) from C(v₁)×C(v₂), as indicated in Table 1.2.

Let x₁ and x₂ be two random variables distributed uniformly in the space {0,1}^(n). Table 1.1 compares the correlations between x=x₁⊕x₂ and the variables x₁ and x₂ masked by an XOR masking method. The metrics used to analyse the performance of this method are as follows.

Cor(|HW(x ₁ ⊕r)−HW(x ₂ ⊕r)|^(β) ; HW(x))  (15)

and

Cor(|HW(x ₁ ⊕r).HW(x ₂ ⊕r)|^(β) ; HW(x))  (16)

where HW(x) is the Hamming weight of the vector x.

TABLE 1.1 Cor(|HW (x₁ ⊕ r) − Cor(|HW (x₁ ⊕ r) · HW (x₂ ⊕ r)|^(β); HW (x)) HW (x₂ ⊕ r)|^(β); HW (x)) n β = 1 β = 2 β = 3 β = 1 β = 2 β = 3 1 1 1 1 −0.578007 −0.579426 −0.579963 2 0.532322 0.579113 0.568336 −0.315755 −0.366913 −0.368015 3 0.411518 0.452034 0.438087 −0.217523 −0.284781 −0.293768 4 0.351401 0.381051 0.368472 −0.169834 −0.233549 −0.249807 5 0.304950 0.333761 0.324023 −0.137339 −0.198963 −0.217753 6 0.279849 0.302910 0.291607 −0.117385 −0.173757 −0.197643 7 0.258828 0.276712 0.268064 −0.101258 −0.151014 −0.179686 8 0.236417 0.261128 0.249791 −0.087109 −0.136167 −0.164959

Table 2.1 shows the same results, applied on this occasion to the affine masking method according to the invention; the metrics used are as follows:

Cor(|HW(Rx ₁ ⊕r)−HW(Rx ₂ ⊕r)|^(β) ; HW(x))  (17)

Cor(|HW(Rx ₁ ⊕r).HW(Rx ₂ ⊕r)|^(β) ; HW(x))  (18)

TABLE 2.2 Cor(|HW (Rx₁ ⊕ r) − Cor(|HW (Rx₁ ⊕ r) · HW (Rx₂ ⊕ r)|^(β); HW (x)) HW (Rx₂ ⊕ r)|^(β); HW (x)) n β = 1 β = 2 β = 3 β = 1 β = 2 β = 3 1 1 1 1 −0.574882 −0.573609 −0.579249 2 0.535827 0.386256 0.285722 −0.209768 −0.270511 −0.316286 3 0.298929 0.191070 0.136149 −0.090795 −0.137604 −0.164889 4 0.162631 0.103208 0.070132 −0.043678 −0.067954 −0.080933 5 0.091369 0.051445 0.034176 −0.021675 −0.035601 −0.040952 6 0.053028 0.030678 0.025059 −0.009192 −0.017957 −0.019982 7 0.030603 0.014429 0.010588 −0.006485 −0.006548 −0.011328 8 0.011109 0.006532 0.004693 −0.002205 −0.002554 −0.006627

Tables 1.1 and 1.2 show that the metrics in question decrease strongly when n increases in the case of the affine masking method according to the invention. The metrics defined by the relations 15, 16, 17 and 18 use the Hamming weight of a variable x, because there is a known method of approximating the power consumption related to the variable x with the Hamming weight of the same variable x.

These results show that the information associated with two (or more) points on the measurements corresponding to the intermediate data processing of the form Rx₁+r and Rx₂+r is much more weakly correlated with x₁+x₂ than in the prior art solution which has been described. The invention thus makes it possible to resist known attacks of orders greater than 1. 

1. A method of executing an algorithm, said method comprising protecting an electronic device by affine masking, wherein said device executes operations on secret variables x, said secret variables x being binary vectors of a given size N other than zero, said method further comprising replacing said secret variables x using an affine masking operation, by the following affine function: m(x)=R.x+r, where R is a random invertible binary matrix with N rows and N columns and r is a random binary vector of size N.
 2. The method according to claim 1, wherein said operation of the affine masking of a secret variable x is executed by the following steps: generate, for each binary vector z of size N, the table T such that T[z]=Rz+r; and replace said secret variable x with T[x].
 3. The method according to claim 2, wherein said electronic device executes at least one linear operation on a set of secret variables z₁, . . . , z_(m), producing the result z=A₁z₁+A₂z₂+ . . . +A_(m)z_(m), where the variables A₁, A₂ . . . A_(m) are matrices, each of which commutes with the matrix R and its inverse R⁻¹, and the operation of the affine masking of said result z is carried out by the following steps: apply said operation of affine masking to the set of said variables z₁, . . . z_(m) in order to produce the set of masked variables z₁ , . . . , z_(m) ; determine, from said random vector r and a second random binary vector r′, a third random vector r″=r′+(A₁+ . . . +A_(m))r; and determine the result z of the affine masking operation applied to the result z of said linear operation, by the following calculation steps: z =A₁ z ₁ +r″ For i varying from 2 to m, z = z +A_(i) z _(i) z= z+r+r′.
 4. The method according to claim 2, wherein said electronic device executes at least one linear operation on a set of secret variables z₁, . . . , z_(m) of size N, producing the result z=A₁z₁+A₂z₂+ . . . +A_(m)z_(m), where the variables A₁, A₂ . . . A_(m) are matrices which do not commute with the matrix R or its inverse R⁻¹, and the operation of the affine masking of said result z is executed by the following steps: determine, for the set of said binary vectors x of size N, the table T_(R), such that T_(R)[x]=R.x; determine, for the set of said binary vectors x of size N, the table T_(R) ⁻¹, such that T_(R) ⁻¹[x]=R⁻¹x; determine, for the set of said binary vectors x of size N, the tables A_(i) such that A_(i) [x]=T_(R)[A_(i)T_(R) ⁻¹ [x]], for i varying from 1 to m; apply said operation of affine masking to the set of said variables z₁, . . . z_(m) in order to produce the set of masked variables z₁ , . . . , z_(m) ; calculate, from said random vector r and a second random binary vector r′, the binary vector r″=( A₁ [r]+ . . . + A_(m) [r])+r′; and determine the result z of the affine masking operation applied to the result z of said linear operation, by means of the following calculation steps: z = A₁ [ z ₁ ]+r″ For i varying from 2 to m, z = z+ A_(i) [ z _(i) ] z= z+r+r′.
 5. The method according to claim 2, wherein said electronic device executes at least one non-linear operation S on at least one secret variable y, producing the result y′=S(y), and in that the operation of affine masking of said result y′ is executed by the following steps: apply said affine masking operation to the secret variable y in order to produce the result y=R·y+r; determine an adapted operation S′ of the non-linear operation S by the following relation: S′()=R·S(R⁻¹·(+r))+r; and determine the result y′ of the affine masking operation applied to the result y′ of said non-linear operation, by the following relation: y′=S′( y).
 6. The method according to claim 5, wherein said electronic device executes a cryptographic algorithm.
 7. An electronic device which executes operations on secret variables x, comprising means for protecting said variables x by using the steps of the affine masking protection method according to claim
 1. 8. The electronic device according to claim 7, wherein said device is a microcircuit card.
 9. An electronic device which executes operations on secret variables x, comprising means for protecting said variables x by using the steps of the affine masking protection method according to claim
 2. 10. The electronic device according to claim 9, wherein said device is a microcircuit card.
 11. An electronic device which executes operations on secret variables x, comprising means for protecting said variables x by using the steps of the affine masking protection method according to claim
 3. 12. The electronic device according to claim 11, wherein said device is a microcircuit card.
 13. An electronic device which executes operations on secret variables x, comprising means for protecting said variables x by using the steps of the affine masking protection method according to claim
 4. 14. The electronic device according to claim 13, wherein said device is a microcircuit card.
 15. An electronic device which executes operations on secret variables x, comprising means for protecting said variables x by using the steps of the affine masking protection method according to claim
 5. 16. The electronic device according to claim 15, wherein said device is a microcircuit card.
 17. An electronic device which executes operations on secret variables x, comprising means for protecting said variables x by using the steps of the affine masking protection method according to claim
 6. 18. The electronic device according to claim 17, wherein said device is a microcircuit card. 